Starting-point strategy for interior-point algorithms for lower-bound shakedown analysis
نویسندگان
چکیده
منابع مشابه
A starting point strategy for nonlinear interior methods
This paper presents a strategy for choosing the initial point slacks and multipliers in interior methods for nonlinear programming It consists of rst computing a Newton like step to estimate the magnitude of these three variables and then shifting the slacks and multipliers so that they are su ciently positive The new strategy has the option of respecting the initial estimate of the solution gi...
متن کاملInterior point algorithms - theory and analysis
Spend your few moment to read a book even only few pages. Reading book is not obligation and force for everybody. When you don't want to read, you can get punishment from the publisher. Read a book becomes a choice of your different characteristics. Many people with reading habit will always be enjoyable to read, or on the contrary. For some reasons, this interior point algorithms theory and an...
متن کاملLower Bound Shakedown Analysis in Geotechnics
The paper describes some recent developments in the application of lower bound shakedown analysis to geotechnical problems. The theoretical basis of shakedown analysis is briefly reviewed along with the necessary finite element and optimization procedures. In terms of applications, the primary focus is on pavement design which is discussed in some detail.
متن کاملInterior Point Algorithms for Network Ow Problems
A large number of problems in transportation, communications and manufacturing can be modelled as network ow problems. In these problems one seeks to nd the most e cient, or optimal, way to move ow (e.g. materials, information, buses, electrical currents) on a network (e.g. postal network, computer network, transportation grid, power grid). Many of these optimization problems are special classe...
متن کاملInterior Point Algorithms for Integer Programming
An algorithm for solving linear programming problems can be used as a subroutine in methods for more complicated problems. Such methods usually involve solving a sequence of related linear programming problems, where the solution to one linear program is close to the solution to the next, that is, it provides a warm start for the next linear program. The branch and cut method for solving intege...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2011
ISSN: 1617-7061
DOI: 10.1002/pamm.201110132